Nowadays symmetrical patterns are widely used in various industries, such as jewelry design, carpet design, patterns on wallpaper, and textile design. During the design stage, designers perform most of the work manually. Therefore, the development of methods for symmetrical pattern generation is beneficial. In this paper, we are going to present some methods for generating symmetrical patterns using the discrete dynamical system. For this, the discrete dynamical system is considered as a standard iterative method, and then the general algorithm applied for Polynomiography is used for this to generate patterns. Through phase portrait, we analyze the conditions of the existence of some conventional symmetries. Several non-standard iterative methods can be employed to create a variety of visually appealing patterns. These methods include Mann iteration, Ishikawa iteration, and S-iteration which we use them. Through numerous examples, it is demonstrated that by manipulating the parameters and coefficients, it is possible to generate beautiful symmetrical patterns that have potential artistic applications.

Bifurcations leading to chaos have been investigated in a number of one dimensional dynamical systems by varying the parameters incorporated within the systems. The property hyperbolicity has been studied in detail in each case which has significant characteristic behaviours for regular and chaotic evolutions. In the process, the calculations for invariant set have also been carried out. A broad analysis of bifurcations and hyperbolicity provide some interesting results. The fractal property, self-similarity, has also been observed for chaotic regions within the bifurcation diagram. The results of numerical calculations assume significant values.

Let (X, d) be a compact metric space and f: X®X be a continuous map. Consider the metric space (K(X), H) of all non empty compact subsets of X endowed with the Hausdorff metric induced by d. Let  `f: K (X)®K (X) be defined by `f (A)={f (a): aÎA}. We show that Block-Coppels chaos in f implies Block-Coppels chaos in `f if f is a bijection.

We show that a nonautonomous discrete-time dynamical system (NDS) with the ergodic shadowing property is chain mixing. As a result, it is obtained that a $ k $-periodic NDS with the ergodic shadowing property has the shadowing property. In particular, any $ k $-periodic NDS on intervals having the ergodic shadowing is Devaney chaotic. Additionally, we prove that for an equicontinuous NDS with the shadowing property, the notions of topologically mixing, pseudo-orbital specification, weak specification property, and ergodic shadowing property are equivalent.

This article introduces an iterative method for solving discrete optimal control problems involving interconnected nonlinear systems. Using this approach, the discrete and coupled nonlinear boundary value problem (BVP) obtained from the necessary optimality conditions transforms into a sequence of linear time invariant BVPs. Furthermore, the linear BVP at each iteration of the proposed method consists of several decoupled sub-problems, which can be solved in parallel and are unrelated to each other. The solution of these problems, employing common techniques for solving linear difference equations, leads to an optimal control law in a converging series form with uniform convergence. Moreover, a practical approach is presented to extend the designed optimal control to a feedback form. Subsequently, the implementation of the proposed method involves the design of a highly accurate iterative algorithm with low computational complexity, ensuring that the suboptimal control law is obtained with a minimal number of iterations. Finally, the efficacy of this technique is demonstrated through simulation and the solution of various numerical examples.